Abstraction-based Action Ordering in Planning
نویسندگان
چکیده
ion-based Action Ordering in Planning Maria Fox and Derek Long and Julie Porteous Department of Computer and Information Sciences University of Strathclyde, Glasgow, UK
منابع مشابه
Dynamic Inventory Planning with Unknown Costs and Stochastic Demand
Generally ordering policies are done by two methods, including fix order quantity (FOQ) and fix order period (FOP). These methods are static and either the quantity of ordering or the procedure of ordering is fixing in throughout time horizon. In real environments, demand is varying in any period and may be considered as uncertainty. When demand is variable in any period, the traditional and st...
متن کاملGoal Ordering Extraction and Abstract Method
Planning is a class of complex problem. It is a way to improve the efficiency of planning algorithm in extracting and using goal orderings. Because deciding goal orderings is also PSPACE-complete, it is necessary to extract goal orderings efficiently when using goal orderings. The paper presents a method, called GOWN (goal ordering with invariants) and uses state invariants to extract goal orde...
متن کاملOrdering And Focusing In An Architecture For Persuasive Discourse Planning
In this paper, an account is presented of two crucially important aspects of natural language argumentation: the maintenance of coherency and the ordering of argument components. The account sits in an architecture based upon a hierarchical planner which, at the highest level of abstraction, generates an abstract plan describing a coherent argument structure. This plan is then refined to enhanc...
متن کاملPursuing abstract goals in the game of Go
Reasoning and planning at di¤erent levels of abstraction is an important skill in the game of Go, for both human and computer players. Over the years, adversarial planning approaches have become increasingly popular for dealing with large search spaces of two player games such as Go. This article describes a di¤erent approach to adversarial planning, based on an analysis of human Go playing. Ab...
متن کاملLeast-Commitment Action Selection
The principle of least commitment was embraced early in planning research. Hierarchical task networks (HTNs) reason about high-level tasks without committing to specific low-level steps. Partial-order planning arose from a complementary desire to avoid unnecessary ordering commitments. But most of today’s partial-order planning algorithms commit to a single producing step when supporting an ope...
متن کامل